Positive dependence in Markov chains

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Empirical Bayes Estimation in Nonstationary Markov chains

Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical  Bayes estimators  for the transition probability  matrix of a finite nonstationary  Markov chain. The data are assumed to be of  a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...

متن کامل

Monotone dependence in graphical models for multivariate Markov chains

We show that a deeper insight into the relations among marginal processes of a multivariate Markov chain can be gained by testing hypotheses of Granger noncausality, contemporaneous independence and monotone dependence. Granger noncausality and contemporaneous independence conditions are read off a mixed graph, and the dependence of an univariate component of the chain on its parents—according ...

متن کامل

Rates of Convergence for Everywhere - Positive Markov Chains

0. Introduction It is often useful to know that the distribution of a Markov process converges to a stationary distribution, and if possible to know how rapidly convergence takes place. Such rates of convergence are of particular interest when running stochastic algorithms such as Markov chain Monte Carlo (see Gelfand and Smith, 1990; Tierney, 1994), since they indicate how long the algorithm s...

متن کامل

Further Criteria for Positive Harris Recurrence of Markov Chains

We provide several necessary and sufficient conditions for a Markov chain on a general state space to be positive Harris recurrent. The conditions only concern asymptotic properties of the expected occupation measures.

متن کامل

Perfect Simulation for a Class of Positive Recurrent Markov Chains

In [1] we introduced a class of positive recurrent Markov chains, named tame chains. A perfect simulation algorithm, based on the method of dominated CFTP, was then shown to exist in principle for such chains. The construction of a suitable dominating process was flawed, in that it relied on an incorrectly stated lemma ([1], Lemma 6). This claimed that a geometrically ergodic chain, subsampled ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1985

ISSN: 0024-3795

DOI: 10.1016/0024-3795(85)90048-5